A note on extensions of multilinear maps defined on multilinear varieties
نویسندگان
چکیده
Abstract Let $G_1, \ldots , G_k$ be finite-dimensional vector spaces over a prime field $\mathbb {F}_p$ . A multilinear variety of codimension at most $d$ is subset $G_1 \times \cdots defined as the zero set forms, each which on some coordinates. map $\phi$ $B$ if for coordinate $c$ and all choices $x_i \in G_i$ $i\not =c$ restriction $y \mapsto \phi (x_1, x_{c-1}, y, x_{c+1}, x_k)$ linear where defined. In this note, we show that coincides $O_{k}(d^{O_{k}(1)})$ with whole $G_1\times Additionally, in case general finite fields, deduce similar (but slightly weaker) results.
منابع مشابه
Ideal Multilinear Maps based on Ideal Lattices
Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....
متن کاملIdeal Multilinear Maps Based on Ideal Lattices
Cryptographic multilinear maps have many applications, such as multipartite key exchange and software obfuscation. However, the encodings of three current constructions are “noisy” and their multilinearity levels are fixed and bounded in advance. In this paper, we describe a candidate construction of ideal multilinear maps by using ideal lattices, which supports arbitrary multilinearity levels....
متن کاملSome Remarks on Multilinear Maps and Interpolation
A multilinear version of the Boyd interpolation theorem is proved in the context of quasi-normed rearrangement-invariant spaces. A multilinear Marcinkiewicz interpolation theorem is obtained as a corollary. Several applications are given, including estimates for bilinear fractional integrals.
متن کاملObfuscation without Multilinear Maps
Known methods for obfuscating a circuit need to represent the circuit as a branching program and then use a multilinear map to encrypt the branching program. Multilinear maps are, however, too inefficient for encrypting the branching program. We found a dynamic encoding method which effectively singles out different inputs in the context of the matrix randomization technique of Kilian and Gentr...
متن کاملMultilinear Maps from Obfuscation
We provide constructions of multilinear groups equipped with natural hard problems from indistinguishability obfuscation, homomorphic encryption, and NIZKs. This complements known results on the constructions of indistinguishability obfuscators from multilinear maps in the reverse direction. We provide two distinct, but closely related constructions and show that multilinear analogues of the DD...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society
سال: 2021
ISSN: ['1464-3839', '0013-0915']
DOI: https://doi.org/10.1017/s0013091521000055